A Novel Spectral Matching Approach for Pigment: Spectral Subsection Identification Considering Ion Absorption Characteristics
نویسندگان
چکیده
منابع مشابه
A Graph-Spectral Approach to Correspondence Matching
This paper describes a spectral method for graphmatching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probability matrix of a Markov chain. The node-order of the steady state random walk associated with this Markov chain is determined by the co-efficent order of the leading eigenvector of the adjacency matrix. We match nodes in ...
متن کاملRadiometric Characterization of Spectral Imaging for Textual Pigment Identification
Digital imaging of cultural heritage artifacts has become a standard practice. Typically, standard commercial cameras, often commodity rather than scientific grade cameras, are used for this purpose. Commercial cameras are optimized for plausible visual reproduction of a physical scene with respect to trichromatic human vision. However, visual reproduction is just one application of digital ima...
متن کاملBlur identification by residual spectral matching
The estimation of the point spread function (PSF) for blur identification, often a necessary first step in the restoration of real images, method is presented. The PSF estimate is chosen from a collection of candidate PSFs, which may be constructed using a parametric model or from experimental measurements. The PSF estimate is selected to provide the best match between the restoration residual ...
متن کاملB-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maximum weight matching and is solvable in polynomial time. Instead of a permutation matrix, it produces a binary matrix with rows and columns summing to a positive integer b. The b-matching procedure prunes graph edges s...
متن کاملSpectral Descriptors for Graph Matching
In this paper, we consider the weighted graph matching problem. Recently, approaches to this problem based on spectral methods have gained significant attention. We propose two graph spectral descriptors based on the graph Laplacian, namely a Laplacian family signature (LFS) on nodes, and a pairwise heat kernel distance on edges. We show the stability of both our descriptors under small perturb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Remote Sensing
سال: 2020
ISSN: 2072-4292
DOI: 10.3390/rs12203415